Expressiveness and Closure Properties for Quantitative Languages
نویسندگان
چکیده
منابع مشابه
Closure Properties of Ordered Languages
In this note, we solve questions regarding closure properties of ordered languages. Especially, ordered languages form a full abstract family of recursive languages which is neither intersection-nor complementation-closed.
متن کاملCopyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties
Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over strings. We study structural properties, expressiveness, and closure properties of copyless CRA. We show that copyless CRA are strictly less expressive than weighted automata and are not closed under reverse operation. To find a better class we impose re...
متن کاملClosure Properties of Minimalist Derivation Tree Languages
Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; [14, 16]) are closed under intersection with regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identic...
متن کاملExpressiveness of Concurrent Languages
The aim of this thesis is to go through different approaches for proving expressiveness properties in several concurrent languages. We analyse four different calculi exploiting for each one a different technique. We begin with the analysis of a synchronous language, we explore the expressiveness of a fragment of CCS! (a variant of Milner’s CCS where replication is considered instead of recursio...
متن کاملClosure properties of locally finite omega-languages
Locally finite ω-languages, defined via second order quantifications followed by a first order locally finite sentence, were introduced by Ressayre in [Res88]. They enjoy very nice properties and extend ω-languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOCω of locally finite omega languages. In particular we show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2010
ISSN: 1860-5974
DOI: 10.2168/lmcs-6(3:10)2010